On the proximal point algorithm and its Halpern-type variant for generalized monotone operators in Hilbert space
نویسندگان
چکیده
Abstract In a recent paper, Bauschke et al. study $$\rho $$ ρ -comonotonicity as generalized notion of monotonicity set-valued operators A in Hilbert space and characterize this condition on terms the averagedness its resolvent $$J_A.$$ J A . note we show that result makes it possible to adapt many proofs properties proximal point algorithm PPA strongly convergent Halpern-type variant HPPA more general class operators. This also applies quantitative results rates convergence or metastability (in sense T. Tao). E.g. using approach get simple proof for boundedly compact case -comonotone obtain an effective rate metastability. If has modulus regularity w.r.t. $$zer\, A$$ z e r some zero even without any compactness assumption. We operators, prove strong (without assumption) give
منابع مشابه
Inexact Halpern-type proximal point algorithm
We present several strong convergence results for the modified, Halpern-type, proximal point algorithm xn+1 = αnu + (1 − αn)Jβn xn + en (n = 0, 1, . . .; u, x0 ∈ H given, and Jβn = (I + βn A)−1, for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on αn ∈ (0, 1) and βn ∈ (0,∞). These conditions are weaker than those known to us and our results extend and impr...
متن کاملConvergence of a proximal point algorithm for maximal monotone operators in Hilbert spaces
* Correspondence: hbshigh@yeah. net College of Science, Hebei University of Engineering, Handan 056038, China Full list of author information is available at the end of the article Abstract In this article, we consider the proximal point algorithm for the problem of approximating zeros of maximal monotone mappings. Strong convergence theorems for zero points of maximal monotone mappings are est...
متن کاملConvergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces
In this paper, we introduce two kinds of iterative algorithms for finding zeroes of maximal monotone operators, and establish strong and weak convergence theorems of the modified proximal point algorithms. By virtue of the established theorems, we consider the problem of finding a minimizer of a convex function. Mathematics Subject Classification: Primary 47H17; Secondary 47H05, 47H10
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملOn the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
This paper shows, by means of a new type of operator called a splitting operator, that the Douglas-Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm. Therefore, applications of Douglas-Rachford splitting, such as the alternating direction method of multipliers for convex programming decomposition, are also special...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2021
ISSN: ['1862-4480', '1862-4472']
DOI: https://doi.org/10.1007/s11590-021-01738-9